Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second-Order Recurrence Formula

In this paper, we investigate the convergence speed of Arimoto-Blahut algorithm. For many channel matrices, is exponential, but for some matrices it slower than exponential. By analyzing Taylor expansion defining function algorithm, will make conditions clear exponential or convergence. The analysis slow in paper new. Based on analysis, compare speeds algorithm numerically with values obtained our theorems several matrices. purpose to obtain a complete understanding